New Doubling Spanners: Better and Simpler

نویسندگان

  • T.-H. Hubert Chan
  • Mingfei Li
  • Li Ning
  • Shay Solomon
چکیده

In a seminal STOC’95 paper, Arya et al. conjectured that spanners for low-dimensional Euclidean spaces with constant maximum degree, hop-diameter O(logn) and lightness O(logn) (i.e., weight O(logn)· w(MST)) can be constructed in O(n logn) time. This conjecture, which became a central open question in this area, was resolved in the affirmative by Elkin and Solomon in STOC’13 (even for doubling metrics). In this work we present a simpler construction of spanners for doubling metrics with the above guarantees. Moreover, our construction extends in a simple and natural way to provide k-fault tolerant spanners with maximum degree O(k), hop-diameter O(logn) and lightness O(k logn).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Greedy spanners are optimal in doubling metrics

We show that the greedy spanner algorithm constructs a (1+ )-spanner of weight −O(d)w(MST) for a point set in metrics of doubling dimension d, resolving an open problem posed by Gottlieb [11]. Our result generalizes the result by Narasimhan and Smid [15] who showed that a point set in d-dimension Euclidean space has a (1+ )-spanner of weight at most −O(d)w(MST). Our proof only uses the packing ...

متن کامل

Note on Bounded Degree Spanners for Doubling Metrics

We focus on obtaining sparse representations of metrics: these are called spanners, and they have been studied extensively both for general and Euclidean metrics. Formally, a t-spanner for a metric M = (V, d) is an undirected graph G = (V,E) such that the distances according to dG (the shortest-path metric of G) are close to the distances in d: i.e., d(u, v) ≤ dG(u, v) ≤ t d(u, v). Clearly, one...

متن کامل

Approximation Algorithms for Bounded Dimensional Metric Spaces

The study of finite metrics is an important area of research, because of its wide applications to many different problems. The input of many problems (for instance clustering, near-neighbor queries and network routing) naturally involves a set of points on which a distance function has been defined. Hence, one would be motivated to store and process metrics in an efficient manner. The central i...

متن کامل

Near Isometric Terminal Embeddings for Doubling Metrics

Given a metric space (X, d), a set of terminals K ⊆ X , and a parameter t ≥ 1, we consider metric structures (e.g., spanners, distance oracles, embedding into normed spaces) that preserve distances for all pairs inK ×X up to a factor of t, and have small size (e.g. number of edges for spanners, dimension for embeddings). While such terminal (aka source-wise) metric structures are known to exist...

متن کامل

Incubators vs Zombies: Fault-Tolerant, Short, Thin and Lanky Spanners for Doubling Metrics

Recently Elkin and Solomon gave a construction of spanners for doubling metrics that has constant maximum degree, hop-diameter O(log n) and lightness O(log n) (i.e., weight O(log n)·w(MST)). This resolves a long standing conjecture proposed by Arya et al. in a seminal STOC 1995 paper. However, Elkin and Solomon’s spanner construction is extremely complicated; we offer a simple alternative const...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Comput.

دوره 44  شماره 

صفحات  -

تاریخ انتشار 2013